Binary words excluding a pattern and proper Riordan arrays
نویسندگان
چکیده
We study the relation between binary words excluding a pattern and proper Riordan arrays. In particular, we prove necessary and sufficient conditions under which the number of words counted with respect to the number of zeroes and ones bits are related to proper Riordan arrays. We also give formulas for computing the generating functions (d(x), h(x)) defining the Riordan array.
منابع مشابه
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
We consider some Riordan arrays related to binary words avoiding a pattern which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow us to define every element as a linear combination of other elements in the array; the A-sequence is unique while the A-matrix is not. However, for the problems considered in the present paper, we show that the A-matrix ...
متن کاملBinary words avoiding a pattern and marked succession rule
In this paper we study the enumeration and the construction of particular binary words avoiding the pattern 10. By means of the theory of Riordan arrays, we solve the enumeration problem and we give a particular succession rule, called jumping and marked succession rule, which describes the growth of such words according to their number of ones. Moreover, the problem of associating a word to a ...
متن کاملRiordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کاملAn algorithm for proving identities with Riordan transformations
The problem we consider in the present paper is how to find the closed form of a class of combinatorial sums, if it exists. The problem is well known in the literature, and is as old as Combinatorial Analysis is, since we can go back at least to Euler’s time. More recently, Riordan has tried to give a general approach to the subject, proposing a variety of methods, many of which are related to ...
متن کاملProper generating trees and their internal path length
We find the generating function counting the total internal path length of any proper generating tree. This function is expressed in terms of the functions (d(t), h(t)) defining the associated proper Riordan array. This result is important in the theory of Riordan arrays and has several combinatorial interpretations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007